منابع مشابه
Counting Abelian Squares
An abelian square is a nonempty string of length 2n where the last n symbols form a permutation of the first n symbols. Similarly, an abelian r’th power is a concatenation of r blocks, each of length n, where each block is a permutation of the first n symbols. In this note we point out that some familiar combinatorial identities can be interpreted in terms of abelian powers. We count the number...
متن کاملCOUNTING DISTINCT FUZZY SUBGROUPS OF SOME RANK-3 ABELIAN GROUPS
In this paper we classify fuzzy subgroups of a rank-3 abelian group $G = mathbb{Z}_{p^n} + mathbb{Z}_p + mathbb{Z}_p$ for any fixed prime $p$ and any positive integer $n$, using a natural equivalence relation given in cite{mur:01}. We present and prove explicit polynomial formulae for the number of (i) subgroups, (ii) maximal chains of subgroups, (iii) distinct fuzzy subgroups, (iv) non-isomorp...
متن کاملcounting distinct fuzzy subgroups of some rank-3 abelian groups
in this paper we classify fuzzy subgroups of a rank-3 abelian group $g = mathbb{z}_{p^n} + mathbb{z}_p + mathbb{z}_p$ for any fixed prime $p$ and any positive integer $n$, using a natural equivalence relation given in cite{mur:01}. we present and prove explicit polynomial formulae for the number of (i) subgroups, (ii) maximal chains of subgroups, (iii) distinct fuzzy subgroups, (iv) non-isomorp...
متن کاملLatin Squares: Transversals and counting of Latin squares
Author: Jenny Zhang First, let’s preview what mutually orthogonal Latin squares are. Two Latin squares L1 = [aij ] and L2 = [bij ] on symbols {1, 2, ...n}, are said to be orthogonal if every ordered pair of symbols occurs exactly once among the n2 pairs (aij , bij), 1 ≤ i ≤ n, 1 ≤ j ≤ n. Now, let me introduce a related concept which is called transversal. A transversal of a Latin square is a se...
متن کاملAvoiding abelian squares in partial words
Erdös raised the question whether there exist infinite abelian squarefree words over a given alphabet, that is, words in which no two adjacent subwords are permutations of each other. It can easily be checked that no such word exists over a three-letter alphabet. However, infinite abelian square-free words have been constructed over alphabets of sizes as small as four. In this paper, we investi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2009
ISSN: 1077-8926
DOI: 10.37236/161